Network Cooperation with Progressive Disambiguation for Partial Label Learning
نویسندگان
چکیده
Partial Label Learning (PLL) aims to train a classifier when each training instance is associated with set of candidate labels, among which only one correct but not accessible during the phase. The common strategy dealing such ambiguous labeling information disambiguate label sets. Nonetheless, existing methods ignore disambiguation difficulty instances and adopt single-trend mechanism. former would lead vulnerability models false positive labels latter may arouse error accumulation problem. To remedy these two drawbacks, this paper proposes novel approach termed "Network Cooperation Progressive Disambiguation" (NCPD) for PLL. Specifically, we devise progressive operations are performed on simple firstly then gradually more complicated ones. Therefore, negative impacts brought by can be effectively mitigated as ability model has been strengthened via learning from instances. Moreover, employing artificial neural networks backbone, utilize network cooperation mechanism trains collaboratively letting them interact other. As have different ability, interaction beneficial both reduce their respective errors, thus much better than algorithms process. Extensive experimental results various benchmark practical datasets demonstrate superiority our NCPD other state-of-the-art PLL methods.
منابع مشابه
Word Sense Disambiguation Using Label Propagation Based Semi-Supervised Learning
Shortage of manually sense-tagged data is an obstacle to supervised word sense disambiguation methods. In this paper we investigate a label propagation based semisupervised learning algorithm for WSD, which combines labeled and unlabeled data in learning process to fully realize a global consistency assumption: similar examples should have similar labels. Our experimental results on benchmark c...
متن کاملConfidence-Rated Discriminative Partial Label Learning
Partial label learning aims to induce a multi-class classifier from training examples where each of them is associated with a set of candidate labels, among which only one label is valid. The common discriminative solution to learn from partial label examples assumes one parametric model for each class label, whose predictions are aggregated to optimize specific objectives such as likelihood or...
متن کاملLabel Ranking with Partial Abstention using Ensemble Learning
In label ranking, the problem is to learn a mapping from instances to rankings over a finite set of predefined class labels. In this paper, we consider a generalization of this problem, namely label ranking with a reject option. Just like in conventional classification, where a classifier can refuse a presumably unreliable prediction, the idea is to concede a label ranker the possibility to abs...
متن کاملThe selectope for games with partial cooperation
In this paper we de2ne and study some solution concepts for games in which there does not have to be total cooperation between the players. In particular, we show the relations of these solution concepts with the selectope. In this way, we extend the work of Derks, Haller and Peters, METEOR Research Memorandum, Maastricht, RM=97=016 (revised version, 1998). c © 2000 Elsevier Science B.V. All ri...
متن کاملParticle competition and cooperation for semi-supervised learning with label noise
Semi-supervised learning methods are usually employed in the classification of data sets where only a small subset of the data items is labeled. In these scenarios, label noise is a crucial issue, since the noise may easily spread to a large portion or even the entire data set, leading to major degradation in classification accuracy. Therefore, the development of new techniques to reduce the na...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-67661-2_28